FRAGILE: Failure Resilience and Application Guaranteed Integrity in Large-scale Environments

We study consensus in a message-passing system where only some of the n2 links exhibit some synchrony. This problem was previously studied for systems with process crashes; we now consider byzantine failures. We show that consensus can be solved in a system where there is at least one non-faulty process whose links are eventually timely; all other links can be arbitrarily slow. We also show that, in terms of problem solvability, such a system is strictly weaker than one where all links are eventually timely. [AdHocNow05c] Nathalie Mitton and Eric Fleury. Efficient broadcasting in self-organizing multi-hop wireless network. In 4th International Conference on AD-HOC Networks & Wireless (Ad Hoc Now’05), Cancun, Mexico, October 2005. Abstract: Multi-hop wireless networks (such as ad-hoc or sensor networks) consist of sets of mobile nodes without the support of a pre-existing fixed infrastructure. For the purpose of scalability, adMulti-hop wireless networks (such as ad-hoc or sensor networks) consist of sets of mobile nodes without the support of a pre-existing fixed infrastructure. For the purpose of scalability, adhoc and sensor networks may both need to be organized into clusters and require some protocols to perform common global communication patterns and particularly for broadcasting. In a broadcasting task, a source node needs to send the same message to all the nodes in the network. Some desirable properties of a scalable broadcasting are energy and bandwidth efficiency, i.e., message retransmissions should be minimized. In this paper, we propose to